GATE CSE 2015 SET-3
Q31.
Consider the equation (43)_{x}=(y3)_{8} where x and y are unknown. The number of possible solutions is ______________Q32.
Consider the relation X(P,Q,R,S,T,U) with the following set of functional dependencies F= {{P,R}\rightarrow{S,T}, {P,S,U}\rightarrow{Q,R} } Which of the following is the trivial functional dependency in F^{+}, where F^{+} is closure of F ?Q33.
Among simple LR (SLR) , canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful , in that order?Q34.
Consider the following grammar S \rightarrow F|H F \rightarrow p|c H \rightarrow d|c where S,F, and H are non-terminal symbols, p,d, and c are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar GQ35.
Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format. OP Ri, Rj, Rk where operation OP is performed on contents of registers Rj and Rk and the result is stored in register Ri. I1: ADD R1, R2, R3 I2: MUL R7, R1, R3 I3: SUB R4, R1, R5 I4: ADD R3, R2, R4 I5: MUL R7, R8, R9 Consider the following three statements. S1: There is an anti-dependence between instructions l2 and l5 S2: There is an anti-dependence between instructions l2 and l4 S3: Within an instruction pipeline an anti-dependence always creates one or more stalls Which one of above statements is/are correct?Q36.
Consider the following reservation table for a pipeline having three stages S1,S2 and S3. The minimum average latency (MAL) is ________.Q37.
The velocity v (in kilometer/minute) of a motorbike which starts from rest, is given at fixed intervals of time t (in minutes) as follows: The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson's 1/3^{rd} rule is _______________.Q38.
Suppose X_{i} for i =1,2,3 are independent and identically distributed random variables whose probability mass functions are Pr[X_{i}=0]=Pr[X_{i}=1]=1/2 for i=1,2,3. Define another random variable Y=X_{1}X_{2}\oplus X_{3}, \; where \; \oplus denotes XOR. Then Pr[Y=0|X_{3}=0]=_______________.Q39.
The maximum number of processes that can be in Ready state for a computer system with n CPUs isQ40.
Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?